//
// Created by Administrator on 2019/12/3.
//

#include "queue.h"
#include "graph.h"

int queue[MAX_SIZE];
int que_count = 0;

int is_empty_queue() {
    return 0 == que_count;
}

void enqueue(int v) {
    queue[que_count++] = v;
}

int dequeue() {
    int e = queue[0];
    for (int i = 0; i < que_count - 1; ++i) {
        queue[i] = queue[i + 1];
    }

    que_count--;

    return e;
}